Pure strategy Nash equilibria in non-zero sum colonel Blotto games
نویسندگان
چکیده
We analyze a Colonel Blotto game in which opposing parties have di¤ering relative intensities (i.e. the game is non-zero sum). We characterize the colonels payo¤s that sustain a pure strategy equilibrium and present an algorithm that reaches the equilibrium actions (when they exist). Finally we show that the set of games with a pure strategy equilibria is non-empty. JEL Classi cation: C72, D7, P16
منابع مشابه
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games
We study the problem of computing Nash equilibria of zero-sum games. Many natural zerosum games have exponentially many strategies, but highly structured payoffs. For example, in the well-studied Colonel Blotto game (introduced by Borel in 1921), players must divide a pool of troops among a set of battlefields with the goal of winning (i.e., having more troops in) a majority. The Colonel Blotto...
متن کاملA Stochastic Version of Colonel Blotto Game
We consider a stochastic version of the well-known Blotto game, called the gladiator game. In this zero-sum allocation game two teams of gladiators engage in a sequence of one-to-one fights in which the probability of winning is a function of the gladiators’ strengths. Each team’s strategy consist the allocation of its total strength among its gladiators. We find the Nash equilibria and the val...
متن کاملA Colonel Blotto Gladiator Game
We consider a stochastic version of the well-known Blotto game, called the gladiator game. In this zero-sum allocation game two teams of gladiators engage in a sequence of one-to-one fights in which the probability of winning is a function of the gladiators’ strengths. Each team’s strategy consist the allocation of its total strength among its gladiators. We find the Nash equilibria and the val...
متن کاملGeneralizations of the General Lotto and Colonel Blotto Games∗
In this paper, we generalize the General Lotto game (budget constraints satisfied in expectation) and the Colonel Blotto game (budget constraints hold with probability one) to allow for battlefield valuations that are heterogeneous across battlefields and asymmetric across players, and for the players to have asymmetric resource constraints. We completely characterize Nash equilibrium in the ge...
متن کاملA Partial Solution to Continuous Blotto
This paper analyzes the structure of mixed-strategy equilibria for Colonel Blotto games, where the outcome on each battlefield is a polynomial function of the difference between the two players' allocations. This paper severely reduces the set of strategies that needs to be searched to find a Nash equilibrium. It finds that there exists a Nash equilibrium where both players' mixed strategies ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Game Theory
دوره 41 شماره
صفحات -
تاریخ انتشار 2012